Using Decomposition-Parameters for QBF: Mind the Prefix!
نویسندگان
چکیده
Similar to the satisfiability (SAT) problem, which can be seen to be the archetypical problem for NP, the quantified Boolean formula problem (QBF) is the archetypical problem for PSPACE. Recently, Atserias and Oliva (2014) showed that, unlike for SAT, many of the well-known decompositional parameters (such as treewidth and pathwidth) do not allow efficient algorithms for QBF. The main reason for this seems to be the lack of awareness of these parameters towards the dependencies between variables of a QBF formula. In this paper we extend the ordinary pathwidth to the QBF-setting by introducing prefix pathwidth, which takes into account the dependencies between variables in a QBF, and show that it leads to an efficient algorithm for QBF. We hope that our approach will help to initiate the study of novel tailor-made decompositional parameters for QBF and thereby help to lift the success of these decompositional parameters from SAT to
منابع مشابه
Dependency Schemes and Search-Based QBF Solving: Theory and Practice
The logic of quantified Boolean formulae (QBF) extends propositional logic with universal quantification over propositional variables. The presence of universal quantifiers in QBF does not add expressiveness, but often allows for more compact encodings of problems. From a theoretical point of view, the decision problems of propositional logic (SAT) and QBF are NP-complete and PSPACE-complete, r...
متن کاملEfficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Given a quantified boolean formula (QBF) in prenex conjunctive normal form (PCNF), we consider the problem of identifying variable dependencies. In related work, a formal definition of dependencies has been suggested based on quantifier prefix reordering: two variables are independent if swapping them in the prefix does not change satisfiability of the formula. Instead of the general case, we f...
متن کاملNon-prenex QBF Solving Using Abstraction
In a recent work, we introduced an abstraction based algorithm for solving quantified Boolean formulas (QBF) in prenex negation normal form (PNNF) where quantifiers are only allowed in the formula’s prefix and negation appears only in front of variables. In this paper, we present a modified algorithm that lifts the restriction on prenex quantifiers. Instead of a linear quantifier prefix, the al...
متن کاملBDD-based Dynamic Programming on Tree Decompositions
Solving computationally hard problems efficiently is a challenging task in computer science. One approach to tackle such problems is to consider structural properties of the input. Many problems become tractable in case certain parameters of the input are assumed to be fixed. In this work we consider treewidth that, roughly speaking, captures the “tree-likeness” of a graph. It is motivated by t...
متن کاملSymmetry Breaking in Quantified Boolean Formulae
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting such symmetries has been proved to be very important in reducing search efforts. Breaking symmetries using additional constraints is currently one of the most used approaches. Extending such symmetry breaking techniques to quantified boolean formulae (QBF) is a very challenging task. In this paper, an approach to brea...
متن کامل